Localized Positioning method for Optimal path Hierarchical clustering algorithm in Ad hoc network
نویسندگان
چکیده
منابع مشابه
Localized positioning in ad hoc networks
Position centric approaches, such as Cartesian routing, geographic routing, and the recently proposed trajectory based forwarding (TBF), address scalability issues in large ad hoc networks by using Euclidean space as a complementary name space. These approaches require that nodes know their position in a common coordinate system. While a GPS receiver in each node would be ideal, in many cases a...
متن کاملLocal clustering for hierarchical ad hoc networks
Hierarchical, cluster-based routing greatly reduces routing table sizes compared to host-based routing and the amount of routing related signalling traffic, while reducing path efficiency [8] and generating some management traffic [5], [10], [13]. Proposals for and analysis of cluster-based routing in dynamic networks include [9] and [13]. We present a local clustering method that requires no e...
متن کاملTACA: Topology Adaptive Clustering Algorithm for Mobile Ad Hoc Network
The research on various issues in Mobile ad hoc networks are getting popularity because of its challenging nature and all time connectivity to communicate. We propose a topology adaptive clustering algorithm for mobile ad hoc network. Two major node parameters like its mobility and available battery power are considered for the node suitability as cluster head. This results into a faster cluste...
متن کاملPath Availability in Ad Hoc Network
Due to the complexity and high randomness, most current researches on ad hoc networks are based on simulation results and empirical analysis, lacking theoretical understanding of the ad hoc networks and their behavior. This paper presents a general ad hoc network model and derives the statistic results of link and path availability properties in ad hoc network. Simulation results are given to v...
متن کاملClustering Overhead for Hierarchical Routing in Mobile Ad hoc Networks
-Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANETs). However, there is very little formal analysis that considers the communication overhead incurred by these procedures. Further, there is no published investigation of the overhead associated with the recursive application of clustering algorithms to support hierarchical routing. This p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korean Institute of Information and Communication Engineering
سال: 2012
ISSN: 2234-4772
DOI: 10.6109/jkiice.2012.16.11.2550